A New Algorithm for the Monte Carlo Simulation to Capture the Aggregate Structures of Fine Particles. Cluster-moving Monte Carlo Algorithm.
نویسندگان
چکیده
منابع مشابه
A New Approach for Monte Carlo Simulation of RAFT Polymerization
In this work, based on experimental observations and exact theoretical predictions, the kinetic scheme of RAFT polymerization is extended to a wider range of reactions such as irreversible intermediate radical terminations and reversible transfer reactions. The reactions which have been labeled as kinetic scheme are the more probable existing reactions as the theoretical point of view. The ...
متن کاملA cluster algorithm for Monte Carlo simulation at constant pressure.
We propose an efficient algorithm to sample the volume in Monte Carlo simulations in the isobaric-isothermal ensemble. The method is designed to be applied in the simulation of hard-core models at high density. The algorithm is based in the generation of clusters of particles. At the volume change step, the distances between pairs of particles belonging to the same cluster do not change. This i...
متن کاملMonte Carlo simulation algorithm for B-DNA
Understanding the structure-function relationship of biomolecules containing DNA has motivated experiments aimed at determining molecular structure using methods such as small-angle X-ray and neutron scattering (SAXS and SANS). SAXS and SANS are useful for determining macromolecular shape in solution, a process which benefits by using atomistic models that reproduce the scattering data. The var...
متن کاملMonte Carlo Dose Algorithm
Conventional dose calculation algorithms, such as Pencil Beam are proven effective for tumors located in homogeneous regions with similar tissue consistency such as the brain. However, these algorithms tend to overestimate the dose distribution in extracranial regions such as in the lung and head and neck regions where large inhomogeneities exist. Due to the inconsistencies seen in current calc...
متن کاملCluster Monte Carlo algorithm for the quantum rotor model.
We propose a highly efficient "worm"-like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the algorithm even in the presence of disorder. For the pure quantum rotor model with mu=0, the algorithm yields high- precision estimates for the critical point K(c)=0.333 05(5) and the correlation length exponent nu=0....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series B
سال: 1991
ISSN: 0387-5016,1884-8346
DOI: 10.1299/kikaib.57.2690